Compositional Verification and Optimization of Interactive Markov Chains
نویسندگان
چکیده
Interactive Markov chains (IMC) are compositional behavioural models extending labelled transition systems and continuous-time Markov chains. We provide a framework and algorithms for compositional verification and optimization of IMC with respect to time-bounded properties. Firstly, we give a specification formalism for IMC. Secondly, given a time-bounded property, an IMC component and the assumption that its unknown environment satisfies a given specification, we synthesize a scheduler for the component optimizing the probability that the property is satisfied in any such environment.
منابع مشابه
Verification of Open Interactive Markov Chains
Interactive Markov chains (IMC) are compositional behavioral models extending both labeled transition systems and continuous-time Markov chains. IMC pair modeling convenience owed to compositionality properties with effective verification algorithms and tools owed to Markov properties. Thus far however, IMC verification did not consider compositionality properties, but considered closed systems...
متن کاملIMCReo: interactive Markov chains for Stochastic Reo
The study of composed software and its properties is in itself a great challenge. Bringing quantitative aspects into the picture increases the complexity of the analysis and entails the need for reconciling both the classical and the stochastic analyses. The quest herein is to provide constructs for composition of building blocks and semantic models thereof which enable both analyses and allow ...
متن کاملCompositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
This paper presents a compositional framework for the modeling of interactive continuous-time Markov chains with time-dependent rates, a subclass of communicating piecewise deterministic Markov processes. A poly-time algorithm is presented for computing the coarsest quotient under strong bisimulation for rate functions that are either piecewise uniform or (piecewise) polynomial. Strong as well ...
متن کاملDepartment of Computer Science LEARNING-BASED COMPOSITIONAL VERIFICATION FOR SYNCHRONOUS PROBABILISTIC SYSTEMS
We present novel, fully-automated techniques for compositional verification of synchronous probabilistic systems. First, we give an assume-guarantee framework for verifying probabilistic safety properties of systems modelled as discrete-time Markov chains. Assumptions about system components are represented as probabilistic finite automata (PFAs) and the relationship between components and assu...
متن کاملTowards Performance Prediction of Compositional Models in GALS Designs. (Vers la prédiction de performance de modèles compositionnels dans les architectures GALS)
Validation, comprising functional verification and performance evaluation, is critical for complex hardware designs. Indeed, due to the high level of parallelism in modern designs, a functionally verified design may not meet its performance specifications. In addition, the later a design error is identified, the greater its cost. Thus, validation of designs should start as early as possible. Th...
متن کامل